Fast circular dictionary-matching algorithm
نویسندگان
چکیده
Citing this paper Please note that where the full-text provided on King's Research Portal is the Author Accepted Manuscript or Post-Print version this may differ from the final Published version. If citing, it is advised that you check and use the publisher's definitive version for pagination, volume/issue, and date of publication details. And where the final published version is provided on the Research Portal, if citing you are again advised to check the publisher's website for any subsequent corrections.
منابع مشابه
Video Coding Using at Fast Non-Separable Matching Pursuits Algorithm
This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the ef ic ient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match t o diagonally orientated image features. In order to demonstrate the proposed method, a simple dictionary is developed and u...
متن کاملA Fast Method for Sparse Decomposition of Real Second-order Polynomial Phase Signals ⋆
This paper presents a fast method for sparse decomposition of real second-order polynomial phase signals (PPSs). In the method, we first set three concatenate dictionaries to complete the sparse decomposition of real second-order polynomial phase signals. Three concatenate dictionaries are the frequency modulation dictionary, the frequency dictionary and the phase dictionary, respectively. Seco...
متن کاملAn Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملMatching pursuits video coding: Dictionaries and fast implementation
Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression. Unfortunately, apart from very low bit-rate applications, the algorithm involves an extremely high computational load. This paper contains original contribution to the issues of dictionary selection and fast implementation for m...
متن کاملFast-Syntax-Matching-Based Japanese-Chinese Limited Machine Translation
Limited machine translation (LMT) is an unliterate automatic translation based on bilingual dictionary and sentence bank. This paper addresses the Japanese-Chinese LMT problem, proposes two syntactic hypotheses about Japanese texts, and designs a fast-syntax-matching-based Japanese-Chinese (FSMJC) LMT algorithm. In which, the fast syntax matching function, a modified version of Levenshtein func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 27 شماره
صفحات -
تاریخ انتشار 2017